Closed Form Absorption Time Bounds
نویسندگان
چکیده
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this class and we provide the closed form solution for their absorption time distributions. By constructing upper and lower bounding chains that belong to this particular class one can easily compute both lower and upper bounds for absorption time distribution of an arbitrary absorbing Markov chain. We provide a new algorithm for the construction of bounding chains from this class and we show a possible application of these bounds.
منابع مشابه
Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملAn Improved Modular Modeling for Analysis of Closed-Cycle Absorption Cooling Systems
A detailed modular modeling of an absorbent cooling system is presented in this paper. The model including the key components is described in terms of design parameters, inputs, control variables, and outputs. The model is used to simulate the operating conditions for estimating the behavior of individual components and system performance, and to conduct a sensitivity analysis based on the give...
متن کاملAnalysis of transient queues with semidefinite optimization
We derive upper bounds on the tail distribution of the transient waiting time in the GI/GI/1 queue, given a truncated sequence of the moments of the service time and that of the interarrival time. Our upper bound is given as the objective value of the optimal solution to a semidefinite program (SDP) and can be calculated numerically by solving the SDP. We also derive the upper bounds in closed ...
متن کاملGeometric Bounds for Stationary Distributions of In nite Markov Chains Via Lyapunov Functions
In this paper, we develop a systematic method for deriving bounds on the stationary distribution of stable Markov chains with a countably innnite state space. We assume that a Lyapunov function is available that satisses a negative drift property (and, in particular, is a witness of stability), and that the jumps of the Lyapunov function corresponding to state transitions have uniformly bounded...
متن کامل